these are disjoint sets

См. также в других словарях:

• Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… …   Wikipedia

• Disjoint union — In mathematics, the term disjoint union may refer to one of two different concepts: In set theory, a disjoint union (or discriminated union) is a modified union operation that indexes the elements according to which set they originated in;… …   Wikipedia

• Near sets — are disjoint sets that resemble each other. Resemblance between disjoint sets occurs whenever there are observable similarities between the objects in the sets. Similarity is determined by comparing lists of object feature values. Each list of… …   Wikipedia

• Separated sets — In topology and related branches of mathematics, separated sets are pairs of subsets of a given topological space that are related to each other in a certain way.The notion of when two sets are separated or not is important both to the notion of… …   Wikipedia

• Probability distribution — This article is about probability distribution. For generalized functions in mathematical analysis, see Distribution (mathematics). For other uses, see Distribution (disambiguation). In probability theory, a probability mass, probability density …   Wikipedia

• Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… …   Wikipedia

• Sigma additivity — In mathematics, additivity and sigma additivity of a function defined on subsets of a given set are abstractions of the intuitive properties of size (length, area, volume) of a set. Contents 1 Additive (or finitely additive) set functions 2 σ… …   Wikipedia

• Zermelo–Fraenkel set theory — Zermelo–Fraenkel set theory, with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.ZFC consists of a single primitive ontological notion, that of… …   Wikipedia

• Separation axiom — In topology and related fields of mathematics, there are several restrictions that one often makes on the kinds of topological spaces that one wishes to consider. Some of these restrictions are given by the separation axioms. These are sometimes… …   Wikipedia

• Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …   Wikipedia

• Topological property — In topology and related areas of mathematics a topological property or topological invariant is a property of a topological space which is invariant under homeomorphisms. That is, a property of spaces is a topological property if whenever a space …   Wikipedia